منابع مشابه
Sorting and Selecting in Rounds
We present upper bounds for sorting and selecting the median in a fixed number of rounds. These bounds match the known lower bounds to within logarithmic factors. They also have the merit of being "explicit modulo expansion"; that is, probabilistic arguments are used only to obtain expanding graphs, and when explicit constructions for such graphs are found, explicit algorithms for sorting and s...
متن کاملSorting in Few Rounds on the Broadcast Communication Model
The main contribution of this work is to present a simple, fast ranking and sorting algorithms in the broadcast communication model (BCM, for short). At the heart of our algorithm is a new and elegant sampling and bucketing scheme. The main feature of our sampling scheme is that the resulting buckets are well balanced, making costly rebalancing unnecessary. The resulting algorithm uses only 2 n...
متن کاملEigenvalues, geometric expanders, sorting in rounds, and Ramsey theory
Expanding graphs are relevant to theoretical computer science in several ways. Here we show that the points versus hyperplanes incidence graphs of finite geometries form highly (nonlinear) expanding graphs with essentially the smallest possible number of edges. The expansion properties of the graphs are proved using the eigenvalues of their adjacency matrices. These graphs enable us to improve ...
متن کاملEcho Rounds in evolution.
Nikolaos Skubas, MD Since the introduction in the early 1980s, perioperative transesophageal echocardiography (TEE) has steadily evolved from a highly specialized tool limited to practitioners at tertiary care facilities providing anesthesia for cardiac and major vascular surgery to a nearly universally available tool used routinely by thousands of anesthesiologists and critical care physicians...
متن کاملRounds in Combinatorial
The search complexity of a separating system H ⊆ 2 is the minimum number of questions of type “x ∈ H? ” (where H ∈ H) needed in the worst case to determine a hidden element x ∈ [m]. If we are allowed to ask the questions in at most k batches then we speak of the k-round (or k-stage) complexity of H, denoted by ck(H). While 1-round and m-round complexities (called non-adaptive and adaptive compl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1988
ISSN: 0012-365X
DOI: 10.1016/0012-365x(88)90190-2